Observations on Gabriel meshes and Delaunay edge flips
نویسندگان
چکیده
We undertake a study of the local properties of 2-Gabriel meshes: manifold triangle meshes each of whose faces has an open Euclidean diametric ball that contains no mesh vertices. We show that, under mild constraints on the dihedral angles, such meshes are Delaunay meshes: the open geodesic circumdisk of each face contains no mesh vertices. We detail the distinction between these two mesh structures and reveal why the obstructions which prohibit the existence of Gabriel meshes as homeomorphic representatives of smooth surfaces do not hinder the construction of Delaunay meshes. ∗Email: rhdyer, haoz, [email protected]
منابع مشابه
Edge Flips in Surface Meshes
Little theoretical work has been done on edge flips in surface meshes despite their popular usage in graphics and solid modeling to improve mesh equality. We propose the class of (ε, α)-meshes of a surface that satisfy several properties: the vertex set is an ε-sample of the surface, the triangle angles are no smaller than a constant α, some triangle has a good normal, and the mesh is homeomorp...
متن کاملA parallel GPU-based algorithm for Delaunay edge-flips
The edge-flip technique can be used for transforming any existing triangular mesh into one that satisfies the Delaunay condition. Although several implementations for generating Delaunay triangulations are known, to the best of our knowledge no full parallel GPU-based implementation just dedicated to transform any existent triangulation into a Delaunay triangulation has been reported yet. In th...
متن کاملA Quasi-Parallel GPU-Based Algorithm for Delaunay Edge-Flips∗
The Delaunay edge-flip algorithm is a practical method for transforming any existing triangular mesh S into a mesh T (S) that satisfies the Delaunay condition. Although several implementations of this algorithm are known, to the best of our knowledge no parallel GPU-based implementation has been reported yet. In the present work, we propose a quadriphasic and iterative GPU-based algorithm that ...
متن کاملDelaunay Edge Flips in Dense Surface Triangulations
Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of triangulations which are not full dimensional is surface triangulations in three dimensions. In this paper we address the question of converting a surface t...
متن کاملDelaunay mesh construction
We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometrypreserving refinement and prove their correctness. In particular we show that edge flipping serves to reduce mesh surface area, and that a poorly sampled input mesh may yield unflippable edges necessitating refinement to ensure a Delaunay mesh output. Multiresolution Delaunay meshes can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008